num_inp=lambda: int(input())
arr_inp=lambda: list(map(int,input().split()))
sp_inp=lambda: map(int,input().split())
str_inp=lambda:input()
I=input
for _ in[0]*int(I()):
n,m=map(int,I().split());k=l=0
for _ in[0]*n:x=int(I()[::2],2);k+=x<1;l|=x
print('VAisvheiks h'[min(k,m-bin(l).count('1'))%2::2])#include<bits/stdc++.h>
using namespace std;
int main(){
int t;
cin >> t;
while (t--)
{
/* code */
set<int>r,c;
int n,m;
cin >> n>>m;
for(int i=0;i<n;i++){
for (int j =0; j < m; j++)
{
/* code */
int x;
cin >> x;
if(x==1){
r.insert(i);
c.insert(j);
}
}
}
int ans = min(n-r.size(),m-c.size());
if(ans%2==0){
cout <<"Vivek"<<endl;
}
else{
cout << "Ashish"<< endl;
}
}
}137. Single Number II | 130. Surrounded Regions |
129. Sum Root to Leaf Numbers | 120. Triangle |
102. Binary Tree Level Order Traversal | 96. Unique Binary Search Trees |
75. Sort Colors | 74. Search a 2D Matrix |
71. Simplify Path | 62. Unique Paths |
50. Pow(x, n) | 43. Multiply Strings |
34. Find First and Last Position of Element in Sorted Array | 33. Search in Rotated Sorted Array |
17. Letter Combinations of a Phone Number | 5. Longest Palindromic Substring |
3. Longest Substring Without Repeating Characters | 1312. Minimum Insertion Steps to Make a String Palindrome |
1092. Shortest Common Supersequence | 1044. Longest Duplicate Substring |
1032. Stream of Characters | 987. Vertical Order Traversal of a Binary Tree |
952. Largest Component Size by Common Factor | 212. Word Search II |
174. Dungeon Game | 127. Word Ladder |
123. Best Time to Buy and Sell Stock III | 85. Maximal Rectangle |
84. Largest Rectangle in Histogram | 60. Permutation Sequence |